The distribution of m-ary search trees generated by van der Corput sequences
نویسنده
چکیده
The distribution of m-ary search trees generated by van der Corput sequences We study the structure of m-ary search trees generated by the van der Corput sequences. The height of the tree is calculated and a generating function approach shows that the distribution of the depths of the nodes is asymptotically normal. Additionally a local limit theorem is derived.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملWeak multipliers for generalized van der Corput sequences
Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P (i) = ai (mod b) for c...
متن کاملRegularities of the distribution of abstract van der Corput sequences
Similarly to β-adic van der Corput sequences, abstract van der Corput sequences can be defined by abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is computed explicitly, and the bounded remainder sets of the form [0, y) are characterized.
متن کاملVan der Corput Sequences and Linear Permutations
This extended abstract is concerned with the irregularities of distribution of onedimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.
متن کاملVan der Corput sequences towards general ( 0 , 1 ) – sequences in base b par Henri FAURE
As a result of recent studies on unidimensional low discrepancy sequences, we can assert that the original van der Corput sequences are the worst distributed with respect to various measures of irregularities of distribution among two large families of (0, 1)–sequences, and even among all (0, 1)–sequences for the star discrepancy D∗. We show in the present paper that it is not the case for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 6 شماره
صفحات -
تاریخ انتشار 2004